Algebraic flow theory of infinite graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Language Theory and Infinite Graphs

Automata and language theory study finitely presented mechanisms for generating languages. A language is a family of words. A slight shift in focus is very revealing. Instead of grammars and automata as language generators, one views them as propagators of possibly infinite labelled transition graphs. This is our starting point for pushdown automata. The main goal is to report on a proof of dec...

متن کامل

Spectral Theory of Infinite Quantum Graphs

We investigate spectral properties of quantum graphs with infinitely many edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection between spectral properties of a quantum graph with Kirchhoff or, more generally, δ-type couplings at vertices and the corresponding...

متن کامل

Theory of finite and infinite graphs

In what case do you like reading so much? What about the type of the theory of finite and infinite graphs book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge from the book and want to read just to get entertainment. Novels, story book, and other entertaining books become so popular this day. Besides...

متن کامل

(Co)Algebraic Characterizations of Signal Flow Graphs

One of the first publications of Prakash Panangaden is about compositional semantics of digital networks, back in 1984. Digital networks transform streams of input signals to streams of output signals. If the output streams of the components of the network are functions of their input streams, then the behavior of the entire network can be nicely characterized by a recursive stream function. In...

متن کامل

A Sampling Theory for Infinite Weighted Graphs

We prove two sampling theorems for infinite (countable discrete) weighted graphs G; one example being “large grids of resistors” i.e., networks and systems of resistors. We show that there is natural ambient continuum X containing G, and there are Hilbert spaces of functions on X that allow interpolation by sampling values of the functions restricted only on the vertices in G. We sample functio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2017

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2016.11.009